/*
*功能：十字链表的实现稀疏矩阵
*/
#include<stdio.h>
#include<stdlib.h>
#define ElemType int
typedef struct OLNode{
	int i,j;//行与列;
	ElemType e;//元素
	struct OLNode *right,*down;
}OLNode;
typedef struct{
	OLNode* rhead,chead;
	int mu,nu,tu;
}crosslist;
void CreateSMatrix(crosslist* n)
{
	if(n) free(n);
	int a,b,c;
	scanf(&a,&b,&c);
	(*n).mu=a;(*n).nu=b;(*n).tu=c;
	if(!((*n).rhead=(OLNode*)malloc(OLNode);)) printf("内存分配失败！！！");	if(!((*n).chead=(OLNode*)malloc(OLNode);)) printf("内存分配失败！！！");
	(*n).rhead=(*n).chead=NULL;
	
}




